Weakly distinguishing graph polynomials on addable properties
نویسندگان
چکیده
منابع مشابه
Connectivity of addable graph classes
A non-empty class A of labelled graphs is weakly addable if for each graph G ∈ A and any two distinct components of G, any graph that can be obtain by adding an edge between the two components is also in A. For a weakly addable graph class A, we consider a random element Rn chosen uniformly from the set of all graph in A on the vertex set {1, . . . , n}. McDiarmid, Steger and Welsh conjecture [...
متن کاملConnectivity of Addable Monotone Graph Classes ⋆
A class A of labelled graphs is weakly addable if if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and v is also in A; the class A is monotone if for all G ∈ A and all subgraphs H of G, we have H ∈ A. We show that for any weakly addable, monotone class A whose elements have vertex set {1, . . . , n}, the prob...
متن کاملThe Polynomials of a Graph
In this paper, we are presented a formula for the polynomial of a graph. Our main result is the following formula: [Sum (d{_u}(k))]=[Sum (a{_kj}{S{_G}^j}(1))], where, u is an element of V(G) and 1<=j<=k.
متن کاملDynamically distinguishing polynomials
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: For any prime p, reduce its coefficients mod p and consider its action on the field Fp. We say a subset of Z[x] is dynamically distinguishable mod p if the associated mod p dynamical systems are pairwise non-isomorphic. For any k, M ∈ Z>1, we prove that there are infinitely many sets of int...
متن کاملSome Graph Polynomials of the Power Graph and its Supergraphs
In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Moscow Journal of Combinatorics and Number Theory
سال: 2020
ISSN: 2640-7361,2220-5438
DOI: 10.2140/moscow.2020.9.333